首页> 外文OA文献 >Cooperative Joint Localization and Clock Synchronization Based on Gaussian Message Passing in Asynchronous Wireless Networks
【2h】

Cooperative Joint Localization and Clock Synchronization Based on Gaussian Message Passing in Asynchronous Wireless Networks

机译:基于FpGa的协同联合定位与时钟同步   高斯消息在异步无线网络中的传递

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Localization and synchronization are very important in many wirelessapplications such as monitoring and vehicle tracking. Utilizing the same timeof arrival (TOA) measurements for simultaneous localization and synchronizationis challenging. In this paper, we present a factor graph (FG) representation ofthe joint localization and time synchronization problem based on TOAmeasurements, in which the non-line-of-sight measurements are also taken intoconsideration. On this FG, belief propagation (BP) message passing andvariational message passing (VMP) are applied to derive two fully distributedcooperative algorithms with low computational requirements. Due to thenonlinearity in the observation function, it is intractable to compute themessages in closed form and most existing solutions rely on Monte Carlomethods, e.g., particle filtering. We linearize a specific nonlinear term inthe expressions of messages, which enables us to use a Gaussian representationfor all messages. Accordingly, only the mean and variance have to be updatedand transmitted between neighboring nodes, which significantly reduces thecommunication overhead and computational complexity. A message passing schedulescheme is proposed to trade off between estimation performance andcommunication overhead. Simulation results show that the proposed algorithmsperform very close to particle-based methods with much lower complexityespecially in densely connected networks.
机译:定位和同步在许多无线应用中非常重要,例如监视和车辆跟踪。利用相同的到达时间(TOA)测量来进行同步定位和同步具有挑战性。在本文中,我们提出了基于TOA测量的联合定位和时间同步问题的因子图(FG)表示,其中还考虑了非视距测量。在此FG上,应用了信念传播(BP)消息传递和变异消息传递(VMP)来推导两种具有较低计算要求的完全分布式协作算法。由于观察函数的非线性,以封闭形式计算主题很困难,并且大多数现有解决方案都依赖于蒙特卡洛方法,例如粒子滤波。我们在消息的表达式中线性化了一个特定的非线性项,这使我们能够对所有消息使用高斯表示。因此,仅均值和方差必须被更新并且在相邻节点之间传输,这显着降低了通信开销和计算复杂度。提出了一种消息传递调度方案,以在估计性能和通信开销之间进行权衡。仿真结果表明,所提出的算法与基于粒子的方法非常接近,复杂度要低得多,特别是在密集连接的网络中。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号